\n \n \n
\n
\n\n \n \n S N. Diggavi; A R. Calderbank; S. Dusad; and N. Al-Dhahir.\n\n\n \n \n \n \n Diversity Embedded Space-Time Codes.\n \n \n \n\n\n \n\n\n\n
IEEE Transactions on Information Theory, 54(1): 33–50. January 2008.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DCDAj08,\n abstract = {This paper introduces diversity embedded codes, which are space-time codes\nthat simultaneously give different levels of diversity protection to different information\nstreams. The paper provides algebraic constructions based on binary codes designed for\nrank distance and lifts them to the complex domain. It also gives several example of\nlinear diversity embedded codes.},\n author = {S N. Diggavi and A R. Calderbank and S. Dusad and N. Al-Dhahir},\n file = {:papers:dcdafinalversion.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {ddca_j08},\n month = {January},\n note = {},\n number = {1},\n pages = {33--50},\n tags = {journal,DivEmb,OppComm,RankDistCod,CodTh,STcodes},\n title = {Diversity Embedded Space-Time Codes},\n type = {2},\n volume = {54},\n year = {2008}\n}\n\n
\n
\n\n\n
\n This paper introduces diversity embedded codes, which are space-time codes that simultaneously give different levels of diversity protection to different information streams. The paper provides algebraic constructions based on binary codes designed for rank distance and lifts them to the complex domain. It also gives several example of linear diversity embedded codes.\n
\n\n\n
\n\n\n
\n
\n\n \n \n S. Dusad; S N. Diggavi; N. Al-Dhahir; and A R. Calderbank.\n\n\n \n \n \n \n Diversity-Embedded Codes : Theory and practice.\n \n \n \n\n\n \n\n\n\n
IEEE Journal on Selected Topics in Signal Processing, 2(2): 202–219. April 2008.\n
\n\n
\n\n
\n\n
\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DDACj08,\n abstract = {This paper develops in a unified way the theory for diversity embedded codes\nfor broadband (ISI) channels, both from an information theory viewpoint as well as an\nalgebraic coding perspective. It also develops practical aspects by connecting it to unequal\nerror protection for image transmission as well as using diversity embedded codes in conjunction with NUM.},\n author = {S. Dusad and S N. Diggavi and N. Al-Dhahir and A R. Calderbank},\n file = {:papers:ddac.pdf},\n journal = {IEEE Journal on Selected Topics in Signal Processing},\n month = {April},\n note = {},\n number = {2},\n pages = {202--219},\n tags = {journal,DivEmb,OppComm,RankDistCod,CodTh,SucRefDiv,DegMsgSet,STcodes},\n title = {Diversity-Embedded Codes : Theory and practice},\n type = {2},\n volume = {2},\n year = {2008}\n}\n\n
\n
\n\n\n
\n This paper develops in a unified way the theory for diversity embedded codes for broadband (ISI) channels, both from an information theory viewpoint as well as an algebraic coding perspective. It also develops practical aspects by connecting it to unequal error protection for image transmission as well as using diversity embedded codes in conjunction with NUM.\n
\n\n\n
\n\n\n
\n
\n\n \n \n S. Dusad; S N. Diggavi; and A R. Calderbank.\n\n\n \n \n \n \n \n Embedded Rank Distance Codes for ISI channels.\n \n \n \n \n\n\n \n\n\n\n
IEEE Transactions on Information Theory, 54(11): 4866–4886. November 2008.\n
\n\n
\n\n
\n\n
\n\n \n \n arxiv\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\n
@article{DDCj08,\n abstract = {This paper introduces the problem of diversity embedded codes for inter-symbol\ninterference (ISI) channels and gives algebraic constructions for them. These constructions\nare based on designing binary rank-distance codes with a specific (Toeplitz-like) constraint\nand lifting them to the complex domain through set-partitioning maps. As a special case\nthese algebraic constructions also give rate-diversity optimal codes for transmission over\nISI channels when there are transmit alphabet constraints.},\n author = {S. Dusad and S N. Diggavi and A R. Calderbank},\n file = {:papers:ddcfinalrankdist.pdf},\n journal = {IEEE Transactions on Information Theory},\n month = {November},\n note = {},\n number = {11},\n pages = {4866--4886},\n tags = {journal,DivEmb,OppComm,RankDistCod,CodTh,STcodes},\n title = {Embedded Rank Distance Codes for ISI channels},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0707.4311},\n volume = {54},\n year = {2008}\n}\n\n
\n
\n\n\n
\n This paper introduces the problem of diversity embedded codes for inter-symbol interference (ISI) channels and gives algebraic constructions for them. These constructions are based on designing binary rank-distance codes with a specific (Toeplitz-like) constraint and lifting them to the complex domain through set-partitioning maps. As a special case these algebraic constructions also give rate-diversity optimal codes for transmission over ISI channels when there are transmit alphabet constraints.\n
\n\n\n
\n\n\n\n\n\n